//
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <sstream>
#include <algorithm>

using namespace std;

class NumberofFiboCalls
{
	public:
		vector <int> fiboCallsMade(int n)
		{
			count1 = 0;
			count2 = 0;
			fabonacci(n);
			vector<int> v;
			v.push_back(count1);
			v.push_back(count2);
			return v;
		}
		int fabonacci(int n)
		{
			if(n == 0)
			{
				count1++;
				return 0;
			}
			if(n == 1)
			{
				count2++;
				return 1;
			}
			return fabonacci(n-1) + fabonacci(n-2);
		}
		int count1;
		int count2;
};
